SYNTHESIS OF SUPERVISED CONTROLLER BASED ON BOOLEAN CONSTRAINTS AND BOOLEAN AUTOMATA
نویسندگان
چکیده
منابع مشابه
Synthesis of Supervised Controller Based on Boolean Constraints and Boolean Automata
In order to establish a method to synthesis controllers, an essential step is the modelling of both plant and constraints. However, this step remains a very complex task. To mitigate this difficulty and facilitate modelling, we present a methodology for plant modelling based on rules; as well as a user friendly methodology for constraints modelling based on logical equations in the traditional ...
متن کاملOmega-almost Boolean rings
In this paper the concept of an $Omega$- Almost Boolean ring is introduced and illistrated how a sheaf of algebras can be constructed from an $Omega$- Almost Boolean ring over a locally Boolean space.
متن کاملBoolean matching based on Boolean unification
We consider the problem of detecting the equivalence of two single-output Boolean functions , considering the permutation and complementation of their inputs, complementation of outputs, and their associated don't-care sets. This is often referred to as the Boolean matching problem. Boolean matching is a veriication problem, and it has important applications in logic synthesis problems such as ...
متن کاملBDD-Based Boolean Functional Synthesis
Boolean functional synthesis is the process of automatically obtaining a constructive formalization from a declarative relation that is given as a Boolean formula. Recently, a framework was proposed for Boolean functional synthesis that is based on Craig Interpolation and in which Boolean functions are represented as And-Inverter Graphs (AIGs). In this work we adapt this framework to the settin...
متن کاملDecision Procedures for Inductive Boolean Functions Based on Alternating Automata
We show how alternating automata provide decision procedures for the equality of inductively de3ned Boolean functions and present applications to reasoning about parameterized families of circuits. We use alternating word automata to formalize families of linearly structured circuits and alternating tree automata to formalize families of tree structured circuits. We provide complexity bounds fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC Proceedings Volumes
سال: 2006
ISSN: 1474-6670
DOI: 10.3182/20060517-3-fr-2903.00164